Sums of powered characteristic roots count distance-independent circular sets
نویسندگان
چکیده
منابع مشابه
Sums of powered characteristic roots count distance-independent circular sets
Significant values of a combinatorial count need not fit the recurrence for the count. Consequently, initial values of the count can much outnumber those for the recurrence. So is the case of the count, Gl(n), of distance-l independent sets on the cycle Cn, studied by Comtet for l ≥ 0 and n ≥ 1 [sic]. We prove that values of Gl(n) are nth power sums of the characteristic roots of the correspond...
متن کاملUniquely Remotal Sets in $c_0$-sums and $ell^infty$-sums of Fuzzy Normed Spaces
Let $(X, N)$ be a fuzzy normed space and $A$ be a fuzzy boundedsubset of $X$. We define fuzzy $ell^infty$-sums and fuzzy $c_0$-sums offuzzy normed spaces. Then we will show that in these spaces, all fuzzyuniquely remotal sets are singletons.
متن کاملClique-independent sets of Helly circular-arc graphs
A circular-arc graph is the intersection graph of arcs of a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independent set of a graph is a set of pairwise disjoint cliques of the graph. It is NP-hard to compute the maximum cardinality of a clique-independent set for a general graph. In the present paper, we propose al...
متن کاملDegrees of M-fuzzy families of independent L-fuzzy sets
The present paper studies fuzzy matroids in view of degree. First wegeneralize the notion of $(L,M)$-fuzzy independent structure byintroducing the degree of $M$-fuzzy family of independent $L$-fuzzysets with respect to a mapping from $L^X$ to $M$. Such kind ofdegrees is proved to satisfy some axioms similar to those satisfiedby $(L,M)$-fuzzy independent structure. ...
متن کاملCircular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples
Given a set D of positive integers, the distance graph G(Z , D) has all integers as vertices, and two vertices are adjacent if and only if their difference is in D; that is, the vertex set is Z and the edge set is {uv : |u − v| ∈ D}. We call D the distance set. This paper studies chromatic and circular chromatic numbers of some distance graphs with certain distance sets. The circular chromatic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2013
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1658